GridEx: An Algorithm for Knowledge Extraction from Black-Box Regressors

نویسندگان

چکیده

Knowledge-extraction methods are applied to ML-based predictors attain explainable representations of their operation when the lack interpretable results constitutes a problem. Several algorithms have been proposed for knowledge extraction, mostly focusing on extraction either lists or trees rules. Yet, most them only support supervised learning – and, in particular, classification tasks. Iter is among few rule-extraction capable extracting symbolic rules out sub-symbolic regressors. However, its performance here intended as interpretability it extracts easily degrades complexity regression task at hand increases. In this paper we propose GridEx, an extension algorithm, aimed form if-then-else from any sort regressor—there including neural networks arbitrary depth. With respect Iter, GridEx produces shorter rule retaining higher fidelity w.r.t. original regressor. We report several experiments assessing against and Cart (i.e., decision-tree regressors) used benchmarks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge Extraction from the Neural ‘Black Box’ in Ecological Monitoring

Phytoplankton biomass within the Saginaw Bay ecosystem (Lake Huron, Michigan, USA) was characterized as a function of select physical/chemical indicators. The complexity and variability of ecological systems typically make it difficult to model the influences of anthropogenic stressors and/or natural disturbances. Here, Artificial Neural Networks (ANNs) were developed to model chlorophyll a con...

متن کامل

An Algorithm for Knowledge Base Extraction

Many approaches have been proposed for reasoning based on conflicting information in general and in particular on stratified knowledge bases, i.e. bases in which all pieces of information are assigned a rank. In this paper, we want to reflect on a particular family of algorithmic approaches known as Adjustments, which have been suggested for extracting a consistent knowledge base from a possibl...

متن کامل

Lower Bounds on Black-Box Ring Extraction

The black-box ring extraction problem is the problem of extracting a secret ring element from a black-box by performing only the ring operations and testing for equality of elements. An efficient algorithm for the black-box ring extraction problem implies the equivalence of the discrete logarithm and the Diffie-Hellman problem. At the same time this implies the inexistence of secure ring-homomo...

متن کامل

An algorithm of knowledge extraction from trained neural networks

The presented paper describes a method of knowledge extraction that is based on analysis of the trained ANN's weights The method allows to determine the significance of particular inputs, to prove their synergy as well as to find some symbolic rules, that determine the direction of influence of particular inputs.

متن کامل

Nearly Simultaneously Resettable Black-Box Zero Knowledge

An important open question in Cryptography concerns the possibility of achieving secure protocols even in the presence of physical attacks. Here we focus on the case of proof systems where an adversary forces the honest player to re-use its randomness in different executions. In 2009, Deng, Goyal and Sahai [1] constructed a simultaneously resettable non-black-box zero-knowledge argument system ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-82017-6_2